Efficient algorithms for path partitions

An [a, b] path partition is a decomposition of the edges of a graph into a independent path sets and b matchings, where an independent path set is a set of paths that do not intersect each other. The path partition problem is related to other edge partition problems, such as edge coloring. It is shown that every graph with maximum degree 3 has a [LO] path partition, and every graph with maximum degree 4 has a [2,1] path partition. Algorithmic proofs are given. The algorithms have linear-time sequential implementations and log-time parallel implementations.